Termination w.r.t. Q proof of TRS/TRCSREx26_Luc03b

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)))
sqr(0) → 0
sqr(s) → s
dbl(0) → 0
dbl(s) → s
add(0, X) → X
add(s, Y) → s
first(0, X) → nil
first(s, cons(Y)) → cons(Y)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)))
sqr(0) → 0
sqr(s) → s
dbl(0) → 0
dbl(s) → s
add(0, X) → X
add(s, Y) → s
first(0, X) → nil
first(s, cons(Y)) → cons(Y)

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

terms₁ > [cons₁, first_2] > nil > recip₁
terms₁ > sqr₁ > recip₁
s > [cons₁, first_2] > nil > recip₁
dbl₁ > 0 > recip₁
add₂ > recip₁

Status:

dbl₁: multiset
first₂: multiset
terms₁: multiset
recip₁: multiset
sqr₁: multiset
add₂: multiset
0: multiset
s: multiset
cons₁: [1]
nil: multiset